#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char str[maxn];
LL sum[maxn];
LL solve(LL l,LL r){
    LL sum=0;
    for(LL i=l;i<=r;i++){
        sum=sum*2+(str[i]-'0');
    }
    return sum;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    cin>>(str+1);
    LL len=strlen(str+1);
    for(LL i=0;i<len+10;i++) sum[i]=0;
    LL num=0;
    for(LL i=1;i<=len;i++){
        if(str[i]=='1'){sum[i]=num;num=0;}
        else num++;
    }
    LL ans=0;
    for(LL i=1;i<=len;i++){
        if(str[i]=='1'){
            for(LL j=i;j<i+20&&j<=len;j++){
            LL k=solve(i,j);
            if(sum[i]+j-i+1>=k) ans++;
            }
        }
    }
    cout<<ans<<"\n";
  }
return 0;
}
